Validity of Positive XPath Queries with Wildcard in the Presence of DTDs
نویسندگان
چکیده
This paper discusses the validity problem for positive XPath queries with wildcard in the presence of DTDs. A given XPath query p is valid under a DTD D if, for every XML document T conforming to D, the answer to p on T is nonempty. The validity problem is one of the basic static analyses of queries, together with the satisfiability and the containment problems. Although the validity problem is the dual of the satisfiability problem, the complexity of validity for positive XPath classes is not obvious because the XPath class does not contain the negation operator. In this paper, first, it is shown that the path union operator in XPath queries easily makes the validity problem intractable. Then, we focus on wildcard, which is a special case of path union and more popular than path union in the real world. Interestingly, wildcard together with child and descendant-orself axes and qualifier causes intractability while the validity problem becomes tractable for XPath classes defined by any combination of three of child axis, descendant-or-self axis, qualifier, and wildcard.
منابع مشابه
Satisfiability of XPath Queries with Sibling Axes
We study the satisfiability problem for XPath fragments supporting the following-sibling and preceding-sibling axes. Although this problem was recently studied for XPath fragments without sibling axes, little is known about the impact of the sibling axes on the satisfiability analysis. To this end we revisit the satisfiability problem for a variety of XPath fragments with sibling axes, in the p...
متن کاملXPath Containment in the Presence of Disjunction, DTDs, and Variables
XPath is a simple language for navigating an XML tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various fragments of XPath. In addition to the basic operations (child, descendant, filter, and wildcard), we consider disjunction, DTDs and variables. W.r.t. variables we study two semantics: (1) the value of variables is given b...
متن کاملXPath Query Satisfiability and Containment under DTD Constraints
In this thesis, we consider the XML query language XPath, along with XML documents whose integrity constraints are presented in the form of document type definitions (DTDs). In particular, we study the problems of XPath satisfiability and XPath containment in the presence of DTDs. The motivation for studying XPath is that it is the main language for navigating in and extracting information from...
متن کاملChasing One's Tail: XPath Containment Under Cyclic DTDs
The problem of finding subclasses of XPath queries and document type definitions (DTDs) for which containment can be tested efficiently has been much studied. Along the way, a number of constraints inferred from DTDs have been used to characterise containment in terms of the chase procedure. However, previous attempts have resulted in procedures that are non-terminating for cyclic DTDs, even wh...
متن کاملTaming XPath Queries by Minimizing Wildcard Steps
This paper presents a novel and complementary technique to optimize an XPath query by minimizing its wildcard steps. Our approach is based on using a general composite axis called the layer axis, to rewrite a sequence of XPath steps (all of which are wildcard steps except for possibly the last) into a single layer-axis step. We describe an efficient implementation of the layer axis and present ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011